Perfect broadcasting in unlabeled networks

Perfect Broadcasting in Unlabeled Networks

We consider broadcasting a message from one node to all other nodes of an asynchronous totally unlabeled network: neither nodes nor links of the network have a priori assigned labels but they know the topology of the network. Nodes can send messages of arbitrary size and we are interested in minimizing the total number of messages. Broadcasting in an n-node unlabeled network is perfect if it us...

Broadcasting in Unlabeled Networks

We consider broadcasting a message from one node to all other nodes of an asynchronous totally unlabeled network: neither nodes nor links of the network have a priori assigned labels but they know the topology of the network. Nodes can send messages of arbitrary size and we are interested in minimizing the total number of messages. Broadcasting in an n-node unlabeled network is perfect if it us...

Broadcasting in Unlabeled Tori

We consider broadcasting a message from one node to all other nodes of an asynchronous totally unlabeled torus: neither nodes nor links have a priori assigned labels but they know the topology and the size of the torus. Nodes can send messages of arbitrary size and we are interested in minimizing the total number of messages. A naive broadcasting algorithm in a n n totally unlabeled torus uses ...

Broadcasting in Unlabeled Hypercubes with a Linear Number of Messages

We consider broadcasting a message from one node to all other nodes of an asynchronous totally unlabeled n-node hypercube. Neither nodes nor links have a priori assigned labels. We show a broadcasting algorithm which uses only O(n) messages. This answers aarmatively an open question of G. Tel 17].

Broadcasting in Opportunistic Networks